On Longest Increasing Subsequences and Random Young Tableaux: Experimental Results and Recent Theorems
نویسنده
چکیده
Ulam (1961) apparently first posed the following question: what is the average (or distribution of) the length Ln of the longest increasing subsequence of a random permutation of the first n integers? Experimental (Monte-Carlo) evidence has played an important role in the study of Ln begining with Ulam (1961), and continuing with Baer and Brock (1969), and Odlyzko and Rains (2000). We present experimental evidence concerning the distribution of the length Ln of the longest increasing increasing subsequence of a random permutation of length n. In particular, the experimental data confirm the known result E(Ln) ∼ 2 √ n and strongly suggest that V ar(Ln) ∼ cn for a constant c ≈ .818 . . .. This supports and complements the recent results of Baik, Deift, and Johansson (1999), who apparently knew of the monte-carlo results of Odlyzko and Rains (2000). In the last section we also combine our experimental results with those of Odlyzko and Rains (2000). AMS 2000 subject classifications. Primary: 60G15, 60G99; secondary 60E05.
منابع مشابه
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process
We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al. [BHMZ11]). We show that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS). We connect this parameter to an interactive particle system, a multiset extension of Hammersley’s process, and investigate i...
متن کاملLongest Increasing Subsequences : From PatienceSorting to the
We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation via the Schensted correspondence. A recent highlight of this area is the work of Baik-Deift-Johansson which yields limiting probability laws via hard analysis of Toeplitz determinants.
متن کاملLongest Increasing Subsequences: from Patience Sorting to the Baik-deift-johansson Theorem
We describe a simple one-person card game, patience sorting. Its analysis leads to a broad circle of ideas linking Young tableaux with the longest increasing subsequence of a random permutation via the Schensted correspondence. A recent highlight of this area is the work of Baik-Deift-Johansson which yields limiting probability laws via hard analysis of Toeplitz determinants.
متن کاملIncreasing Subsequences and the Classical Groups
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we show that the 2n-th moment of the trace of a random k-dimensional unitary matrix is equal to the number of permutations of length n with no increasing subsequence of length greater than k. We then generalize this to ot...
متن کاملDescending subsequences of random permutations
Given a random permutation of the numbers 1, 2, . . . . n, let L, be the length of the longest descending subsequence of this permutation. Let F, be the minimal header (first element) of the descending subsequences having maximal length. It is known that EL,/&,,,, c and that c=2. However, the proofs that r=2 are far from elementary and involve limit processes. Several relationships between thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002